Solving Numerical NP-Complete Problems with Spiking Neural P Systems
نویسندگان
چکیده
neural nets: Tissue P systems. In Proceedings of COCOON 2002, Singapore, LNCS 2387, Springer-Verlag, Berlin, 290–299. 15. M. Oswald. Independent agents in a globalized world modelled by tissue P systems. Conf. Artificial Life and Robotics, 2006. 16. Gh. Păun. Computing with Membranes. Journal of Computer and System Sciences, 61:108–143, 2000. See also Turku Centre for Computer Science — TUCS Report No. 208, 1998. Available at: http://www.tucs.fi/Publications/techreports/ TR208.php 17. Gh. Păun. Computing with Membranes. An Introduction. Bulletin of the EATCS, 67(2):139–152, 1999. Solving Numerical NP-Complete Problems with SN P Systems 423 18. Gh. Păun. Membrane Computing. An Introduction. Springer–Verlag, Berlin, 2002. 19. Gh. Păun, M.J. Pérez-Jiménez, G. Rozenberg. Infinite spike trains in spiking neural P systems. Submitted for publication. 20. Gh. Păun, G. Rozenberg. A Guide to Membrane Computing. Theoretical Computer Science, 287(1):73–100, 2002. 21. Gh. Păun, Y. Sakakibara, T. Yokomori. P Systems on Graphs of Restricted Forms. Publicationes Mathematicae Debrecen, 60:635–660, 2002. 22. C. Zandron, C. Ferretti, G. Mauri. Solving NP–Complete Problems Using P Systems with Active Membranes. In I. Antoniou, C.S. Calude, M.J. Dinneen (eds.), Unconventional Models of Computation, Springer-Verlag, London, 2000, 289–301. 23. The P systems Web page: http://psystems.disco.unimib.it/
منابع مشابه
Solving Numerical NP-complete Problems by Spiking Neural P Systems with Pre–computed Resources
Recently we have considered the possibility of using spiking neural P systems for solving computationally hard problems, under the assumption that some (possibly exponentially large) pre-computed resources are given in advance. In this paper we continue this research line, and we investigate the possibility of solving numerical NP-complete problems such as Subset Sum. In particular, we first pr...
متن کاملSolving Subset Sum Problems by Time-free Spiking Neural P Systems
In membrane computing, spiking neural P systems (shortly called SN P systems) are a group of neural-like computing models inspired from the way spiking neurons communication in form of spikes. In previous works, SN P systems working in a nondeterministic manner have been used to solve numerical NP-complete problems, such as SAT, vertex cover, in feasible time. In these works, the application of...
متن کاملSolving NP-Complete Problems by Spiking Neural P Systems with Budding Rules
1 Computational Biomodelling Laboratory Åbo Akademi University Department of Information Technologies 20520 Turku, Finland [email protected] 2 Università degli Studi di Milano – Bicocca Dipartimento di Informatica, Sistemistica e Comunicazione Viale Sarca 336/14, 20126 Milano, Italy [email protected] 3 Key Laboratory of Image Processing and Intelligent Control Department of Control Scien...
متن کاملUsing Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems
Constraint satisfaction problems (CSP) are at the core of numerous scientific and technological applications. However, CSPs belong to the NP-complete complexity class, for which the existence (or not) of efficient algorithms remains a major unsolved question in computational complexity theory. In the face of this fundamental difficulty heuristics and approximation methods are used to approach i...
متن کاملFour Recent Research Topics on Numerical and Spiking Neural P Systems
Two research directions on numerical P systems and two on spiking neural P systems which were recently explored are shortly discussed. They deal with very natural versions of these classes of P systems which were not investigated before. Besides definitions, one recalls a few of the results obtained about these new classes of P systems and one points out open problems and directions for further...
متن کامل